On the equivalence problem for regular Thue systems
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولOn the Equivalence Problem for Attribute Systems
The authors have shown in Courcelle et al. (1982) that certain attribute systems called strongly noneireular can be translated into recursive program schemes taking derivation trees as arguments and called primitive reeursive schemes with parameters. In particular, the equivalence problem for strongly noncircular attribute systems reduces to the equivalence problem for the latter class of progr...
متن کاملThe Equivalence Problem for LL - and L / ? - Regular Grammars
The equivalence problem for context-free grammars is “given two arbitrary grammars, do they generate the same language ?” Since this is undecidable in general attention has been restricted to decidable subclasses of the context-free grammars. For example, the classes of U(k) grammars and real-time strict deterministic grammars. In this paper it is shown that the equivalence problem for U-regula...
متن کاملThe Unification Problem for One Relation Thue Systems
We give an algorithm for the unification problem for a generalization of Thue Systems with one relation. The word problem is a special case. We show that in many cases this is a decision procedure with at most an exponential time bound. We conjecture that this is always a
متن کاملThe Equivalence Problem for LL- and LR-Regular Grammars
Questions whether or not two grammars belonging to a family of grammars generate the same language have extensively been studied in the literature. These problems are called equivalence problems and if there exists an algorithm which for each pair of grammars of this family gives an answer to this question then the equivalence problem for this family of grammars is said to be decidable. Otherwi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1986
ISSN: 0304-3975
DOI: 10.1016/0304-3975(86)90121-0